Arumugam, S., Kamatchi, N., Vijayakumar, G. R.. Faculty of Mathematics, Computer Science and Econometrics, University of Zielona Gora; 2014. On the uniqueness of D-vertex magic constant.
Hits: 1962
Visitors: 1939
Downloads: 0
Arumugam, S., Jerry, Sithara. Faculty of Science, University of Kragujevac; 2012. The convexity graph of minimal total dominating functions of a graph.
Hits: 400
Visitors: 388
Downloads: 0
Arumugam, S., Bloom, G. S., Miller, Mirka, Ryan, Joe. Kalasalingam University; 2009. Some open problems on graph labelings.
Hits: 696
Visitors: 864
Downloads: 0
Arumugam, S., Raja Chandrasekar, K., Misra, Neeldhara, Philip, Geevarghese, Saurabh, Saket. Springer; 2011. Algorithmic aspects of dominator colorings in graphs.
Hits: 2123
Visitors: 2369
Downloads: 1
Arumugam, S., Ebadi, Karam, Manrique, Martin. University of Manitoba, Department of Computer Science; 2014. Co-secure and secure domination in graphs.
Hits: 1824
Visitors: 1919
Downloads: 0
Arumugam, S., Lakshmanan, R., Nagar, Atulya K.. Academic Press; 2013. Graph access structures with optimal pixel expansion three.
Hits: 765
Visitors: 846
Downloads: 0
Arumugam, S., Raja Chandrasekar, K.. Charles Babbage Research Centre; 2012. On chromatic transversal domination in graphs.
Hits: 787
Visitors: 762
Downloads: 0
Arumugam, S., Bagga, Jay, Chandrasekar, K. Raja. Indian Academy of Sciences; 2012. On dominator colorings in graphs.
Hits: 1623
Visitors: 1598
Downloads: 0
Arumugam, S., Martin, Latha. Taru Publications; 2011. Degrees and degree sequence of k-edge d-critical graphs.
Hits: 1060
Visitors: 1025
Downloads: 0
Arumugam, S., Bača, M, Froncek, D, Ryan, J, Sugeng, KA. Kalasalingam University; 2013. Some open problems on graph labelings.
Hits: 4563
Visitors: 4948
Downloads: 464
Arumugam, S., Sundarakannan, M.. National Inquiry Services Centre; 2015. On equality in an upper bound for the equivalence domination number.
Hits: 562
Visitors: 524
Downloads: 0
Manrique, Martín, Arumugam, S.. Springer; 2015. Vertex and edge dimension of hypergraphs.
Hits: 1089
Visitors: 1052
Downloads: 0
Arumugam, S., Nalliah, M.. University of Manitoba; 2016. Super (a, 3)-edge-antimagic total labelings for union of two stars.
Hits: 744
Visitors: 765
Downloads: 0
Arumugam, S., Sundarakannan, M.. Charles Babbage Research Centre; 2012. The equivalence chain of a graph.
Hits: 652
Visitors: 713
Downloads: 0
Arumugam, S., Nalliah, M.. Centre for Discrete Mathematics & Computing; 2012. Super (a, d)-edge antimagic total labelings of friendship graphs.
Hits: 620
Visitors: 569
Downloads: 0
Arumugam, S., Lakshmanan, R., Nagar, Atulya K.. Springer; 2014. On (k, n)*-visual cryptography scheme.
Hits: 892
Visitors: 1040
Downloads: 0
Arumugam, S., Sundarakannan, M.. University of Manitoba; 2013. Equivalence dominating sets in graphs.
Hits: 914
Visitors: 905
Downloads: 0
Arumugam, S., Chandrasekar, K. Raja, Sudha, S.. The Institute of Combinatorics & Its Applications; 2011. Irredundant and open irredundant colorings of graphs.
Hits: 1690
Visitors: 1654
Downloads: 1
Arumugam, S., Lakshmanan, R., Nagar, A.K.. National Academy of Sciences; 2013. Visual cryptography scheme for graphs with vertex covering number two.
Hits: 1631
Visitors: 1708
Downloads: 0
Arumugam, S., Jose, Bibin K., Bujtás, Csilla, Tuza, Zsolt. Elsevier BV; 2013. Equality of domination and transversal numbers in hypergraphs.
Hits: 2500
Visitors: 2454
Downloads: 0
Arumugam, S., Kamatchi, N.. Combinatorial Mathematics Society of Australasia; 2012. On (a, d)-distance antimagic graphs.
Hits: 673
Visitors: 707
Downloads: 0
Arumugam, S., Mathew, Varughese. Elsevier; 2012. The fractional metric dimension of graphs.